The 2-Dimensional Probabilistic Bin Packing Problem : An average case analysis
نویسندگان
چکیده
In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strategy according to an heuristic. According to computational results we show that the redistribution strategy according to some efficient heuristics generates results near those given by the re-optimization strategy which is impossible to be carried out.
منابع مشابه
The 2-Dimensional Probabilistic Bin Packing Problem : An average case analysis of the FBS algorithm
In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strat...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملMultidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis
We describe an algorithm for on-line d-dimensional bin packing which achieves O(n d+1 d+2) average wasted space. This algorithm runs in linear time in the number of items packed.
متن کاملOn Multi-dimensional Packing Problems
line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses.schatz. Resource scheduling in enhanced pay-per-view continuous media databases. An eecient approximation scheme for the one-dimensi...
متن کاملThe Ordered Open-End Bin-Packing Problem
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...
متن کامل